Modern Parallel SAT-Solvers
نویسندگان
چکیده
This paper surveys modern parallel SAT-solvers. It focusses on recent successful techniques and points out weaknesses that have to be overcome to exploit the full power of modern multi-core processors.
منابع مشابه
Parallel Resolution of the Satisfiability Problem: A Survey
The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solvers, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel. Our in...
متن کاملAutomatic construction of parallel portfolios via algorithm configuration
Since 2004, increases in computational power described by Moore’s law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for proposit...
متن کاملManySAT: a Parallel SAT Solver
In this paper, ManySAT a new portfolio-based parallel SAT solver is thoroughly described. The design of ManySAT benefits from the main weaknesses of modern SAT solvers: their sensitivity to parameter tuning and their lack of robustness. ManySAT uses a portfolio of complementary sequential algorithms obtained through careful variations of the standard DPLL algorithm. Additionally, each sequentia...
متن کاملMassive Parallelization of SAT Solvers
Boolean Satisfiability (SAT) is a well known NP-complete problem that forms the basis of modern constraint solving. The canonical problem consists of a conjunction of boolean clauses where each clause is a disjunction of literals. The problem is to determine whether there exists a satisfying assignment (and find it if it does). Despite the theoretical hardness of the SAT problem, modern solvers...
متن کاملModern Cooperative Parallel SAT Solving
Nowadays, powerful parallel SAT solvers are based on an algorithm portfolio. The alternative approach, (iterative) search space partitioning, cannot keep up, although, according to the literature, iterative partitioning systems should scale better than portfolio solvers. This rises often! In this paper we identify key problems in current parallel cooperative SAT solving approaches, most importa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011